Description: 功能较全的LL1文法分析,自定义输入文法,生成first集follow集,再输入句子,判断是否是该文法,并显示栈的状态-function over the entire LL1 grammar analysis, since the definition of input grammar, Generating Sets follow first set, then input sentence, the judge is whether grammar, and that the state Stack Platform: |
Size: 202752 |
Author:chengning |
Hits:
Description: 程序没有写输出部分，所以没有输出C代码，结果只有：
firstcheck.txt： 输出每个left的first，可以检查first有无错
table.txt: 用串来表示table中的值，可以检查table是否正确，但只有在表格小的时候才能看出来
forusetable.txt: 输出的是table中真实的值，-1表示erro，其他值要参照程序里producer的数量，和状态总数来表示其意义，也就是说要用我上学期写的程序来检验表格，还需要根据这次yacc程序来修改读表是动作的确定，但只需要改动几行就行了，总之我没能完成输出麻烦却是很多-Program did not write the output section, there is no output C code, the result only: firstcheck.txt: the output of each left the first, you can check whether the fault first table.txt: use strings to represent the table of values, you can check the table is correct , but only when the table can be seen in small forusetable.txt: the output is real value in the table,-1, said erro, other values should follow the Procedures li producer' s number, and state the total number to express the meaning, that is want to spend my last semester to write a program to test form, also need to read the yacc program to modify the action table is set but only change a few lines on the line, a word I did not complete the output is a lot of trouble Platform: |
Size: 90112 |
Author:王伟 |
Hits:
Description: （1） 根据LL(1)分析法编写一个语法分析程序，可根据自己实际情况，选择以下一项作为分析算法的输入：
a. 直接输入根据已知文法构造的分析表M
b.输入文法的FIRST(α)和FOLLOW(U)集合，由程序自动生成文法的分析表M；
c.输入已知文法，由程序自动构造文法的分析表M。
（2） 程序具有通用性
所开发的程序可适用于不同的文法和任意输入串，且能判断该文法是否为LL(1)文法。
（3） 有运行实例
对于输入的文法和符号串，所编制的语法分析程序应能正确判断此串是否为文法的句子，并要求输出分析过程。
-(1) According to the LL (1) method to write a parser, according to their own situation, choose one of the following analysis of the algorithm as input:
a. directly into the basis of known structures of grammar table M
b. enter the grammar of FIRST (α) and FOLLOW (U) set automatically by the program analysis table statute of Health M
c. Enter known grammar, the program can automatically construct grammatical analysis table M.
(2) program has universal
The developed program used in various types of grammar and an arbitrary input string, and can determine whether the grammar LL (1) grammar.
(3) the running instance
Grammar and symbols for the input string, the parser should be compiled correctly determine whether this string of sentence grammar, and asked the output of the process. Platform: |
Size: 289792 |
Author:zmf |
Hits:
Description: 二维傅里叶变换,对图像进行二维傅里叶变换处理-Two-Dimensional Fast Fourier Transform
The purpose of this project is to develop a 2-D FFT program "package" that will be used
in several other projects that follow. Your implementation must have the capabilities to:
(a) Multiply the input image by (-1)x+y to center the transform for filtering.
(b) Multiply the resulting (complex) array by a real function (in the sense that the
the real coefficients multiply both the real and imaginary parts of the transforms).
Recall that multiplication of two images is done on pairs of corresponding elements.
(c) Compute the inverse Fourier transform.
(d) Multiply the result by (-1)x+y and take the real part.
(e) Compute the spectrum. Platform: |
Size: 1024 |
Author:solo |
Hits:
Description: 本文描述了针对编译原理课程中LL(1)文法分析过程的演示系统的设计与实现过程。本系统在Visual C++环境中使用MFC类库开发实现。针对高效率和美观实用两个目标，分别设计了前台和后台。前台负责界面显示和用户交互，后台透明地执行LL(1)分析过程的相关操作，为前台提供数据。通过MFC的消息响应机制，将后台功能模块加入到前台相应功能菜单的消息函数中。前台界面提供了和用户交互的菜单，根据演示系统的需求以及LL(1)文法分析过程中的各个步骤，将前台分为七个模块，其中每个菜单项分别对应各自的功能模块。它们分别是理论学习、输入产生式、转换产生式、生成FIRST\FOLLOW集合、构造预测分析表、输入句子、预测分析步骤；为实现前台中设计的功能，将后台分成五个模块，分别是产生式的预处理、构造非终结符的FIRST集合、构造FOLLOW集合、构造预测分析表、预测分析。- I described how to design and accomplish a Demo program for the process of LL(1) grammar analysis in Compiler theory. This system is developed by MFC Class Library in Visual C++. Platform: |
Size: 14099456 |
Author:洁 |
Hits:
Description: 车牌字符识别C++程序
1.先打开一幅图片然后按照顺序灰度化、二值化、灰度拉伸、车牌定位、二值化、倾斜校正、字符分割、训练神经网络、识别字符。
2.测试图像存储在当前目录的img下。
3.测试集、训练集、目标向量均存储在img下的文本文件中。-C++ program license plate character recognition
1. Open a picture first and then follow the order of graying, binarization, gray stretch, license plate location, binarization, skew correction, character segmentation, training the neural network to identify characters.
In the current directory img 2. test image storage.
3. The test set, the training set, the text file to the target volume is stored in the img. Platform: |
Size: 19548160 |
Author:feng |
Hits:
Description: 多协议文件传输c/s网络应用设计与实现,程序用 TCP/UDP 两个协议模拟多协议服务器。首先服务器端要将两种协议的套接字创建好，并且监听 TCP 端口的连接。必要时使用select函数来进行多连接处理和非阻塞处理。而客户端直接可以按照发送的地址和端口号来进行通讯。
首先要运行服务器端，服务器会监听 TCP 端口。然后运行客户端，根据事先设定好的 IP和端口，就可以进行连接传输数据了。
程序实现的关键步骤：
以TCP协议为例
服务器端：
1.创建套接字；2.绑定端口；3.进入无穷的循环；4.接收请求；5.处理请求；6.应答。
客户端：
1.找到服务器的IP地址和协议的端口号；2.创建套接字；3.确定连接需要任意的，没有使用的端口号允许TCP去选择一个；4.将套接字和服务器连接；5.使用应用层协议和服务器交互；6.关闭连接。-Multi-protocol file transfer c/s network application design and implementation of programs simulate multi-protocol server with TCP/UDP both protocols. First socket server to create a good two protocols, TCP port and listens for connections. If necessary, use the function to handle multiple connections and non-blocking treatment. And the client can follow directly address and port number to communicate.
First run on the server side, the server listens on TCP port. Then run the client, according to pre-configured IP and port, you can connect the data transmission.
The key step program implementation:
In TCP protocol as an example
Service-Terminal:
1. Create a socket 2 bound port 3 enter an infinite loop 4. receiving a request 5. processing requests 6 response.
Clients:
1. Locate the server s IP address and protocol port number 2 creates a socket 3 connections need to determine arbitrary, unused port allows TCP to choose a 4 and the socket server connections 5 using appli Platform: |
Size: 22675456 |
Author:大酱 |
Hits:
Description: 模拟操作系统采用OPT、FIFO和LRU算法进行页面置换的过程。
设程序中地址范围为0到32767，采用随机数生成256个指令地址，满足50 的地址是顺序执行，25 向前跳，25 向后跳。为满足上述条件，可采取下列方法：
设d0 10000，第 n个指令地址为dn，第 n+1 个指令地址为dn+1 ，n的取值范围为0 到255。每次生成一个 1 到1024范围内的随机数a，如果a落在1 到512 范围内，则dn+1 dn+1。如果a落在513 到768范围内，则设置dn+1 为1 到dn范围内一个随机数。如果a落在769 到1024范围内，则设置dn+1 为dn到32767范围内一个随机数。
页面大小的取值范围为1K，2K，4K，8K，16K 。按照页面大小将指令地址转化为页号。对于相邻相同的页号，合并为一个。
分配给程序的内存块数取值范围为1 块，2 块，直到程序的页面数。
6、 分别采用OPT、FIFO 和LRU算法对页号序列进行调度，计算出对应的缺页中断率。
打印出页面大小、分配给程序的内存块数、算法名、对应的缺页中断率。
操作系统页面置换算法通过c++实现
-Simulation operating system uses OPT, FIFO and LRU page replacement algorithm process. Let the program addresses the range of 0 to 32767, using a random number generator 256 instruction address, the address is to meet 50 of the order, a 25 jump forward, jump back 25 . To meet the above conditions, you can take the following methods: Let d0 10000, n-th instruction address is dn, the first n+1 instruction address dn+1, n the range of 0-255. 1-1024 each generate a random number within a range, if a falls within the range of 1-512, the dn+1 dn+1. If a falls within the range of 513-768, set dn+1 within the range of 1 to dn a random number. If a falls within the range of 769-1024, is set to dn dn+1 to a random number within the range of 32767. Page size in the range of 1K, 2K, 4K, 8K, 16K. Follow the page size of the instruction address into the page number. For the same adjacent page numbers, into one. Memory blocks allocated to the program in the range of 1, 2, until the page number Platform: |
Size: 2643968 |
Author:黄keke |
Hits:
Search - first and follow program in c